Line configuration to minimize setup costs
نویسندگان
چکیده
منابع مشابه
Priority Rule Generation with a Genetic Algorithm to Minimize Sequence Dependent Setup Costs
Setup costs are a crucial factor in many branches of industry and frequently sequence dependent. However, the empirical acquisition of setup costs is inaccurate and not practicable for companies with large product portfolios operating in volatile markets. We therefore propose an abstract model for the estimation of such sequence dependent setup costs and subsequently apply dispatching and sched...
متن کاملThe Batch Machine Scheduling of Continuous Caster with Flexible Jobs to Minimize Setup Costs
The batch machine scheduling of continuous caster with flexible jobs is first proposed based on its character. The difference with classical problem is first summarized. The preprocess of the problem based on rule is proposed, and then the mathematical model with minimizing setup costs is proposed. To improve the efficiency of local search, the particle swarm optimization (PSO) is introduced, a...
متن کاملHeuristics for the flow line problem with setup costs
This paper presents two new heuristics for the owshop scheduling problem with sequencedependent setup times and makespan minimization objective. The rst is an extension of a procedure that has been very successful for the general owshop scheduling problem. The other is a greedy randomized adaptive search procedure (GRASP) which is a technique that has achieved good results on a variety of combi...
متن کاملAssembly line balancing to minimize balancing loss and system loss
Assembly Line production is one of the widely used basic principles in production system. The problem of Assembly Line Balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. Research works reported in the literature mainly deals with minimization of idle time i.e...
متن کاملNo-Wait Flowshops to Minimize Total Tardiness with Setup Times
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been investigated and three were found to be superior. Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching ru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2012
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.12.053